Integer Division Is in Nc 1
نویسندگان
چکیده
An NC 1 circuit for division of binary numbers is presented. By results of Beame, Cook and Hoover this also shows that iterated product and powering are in NC 1 , and by a result of Borodin all three operations are in log-space. This settles an open issue in parallel and space bounded arithmetic complexity.
منابع مشابه
The neural crest cell cycle is related to phases of migration in the head.
Embryonic cells that migrate long distances must critically balance cell division in order to maintain stream dynamics and population of peripheral targets. Yet details of individual cell division events and how cell cycle is related to phases of migration remain unclear. Here, we examined these questions using the chick cranial neural crest (NC). In vivo time-lapse imaging revealed that a typi...
متن کاملSystem Power Minimization to Access Non-Contiguous Spectrum in Cognitive Radio Networks
Wireless transmission using non-contiguous chunks of spectrum is becoming increasingly important due to a variety of scenarios such as: secondary users avoiding incumbent users in TV white space; anticipated spectrum sharing between commercial and military systems; and spectrum sharing among uncoordinated interferers in unlicensed bands. Multi-Channel Multi-Radio (MCMR) platforms and Non-Contig...
متن کاملInteger Nc 1 Is Equal to Boolean Nc 1
We show that the product of n 3 3 matrices of n-bit integers can be computed in P -uniform FNC1. Since this problem is complete [BOC92] for formul in f+; g on n-bit integers, we conclude that \algebraic NC1" on integers is equal to the usual Boolean notion of NC1 functions.
متن کاملPlanar Integer Linear Programming is NC Equivalent to Euclidean GCD
It is not known if planar integer linear programming is P-complete or if it is in NC, and the same can be said about the computation of the remainder sequence of the Euclidean algorithm applied to two integers. However, both computations are NC equivalent. The latter computational problem was reduced in NC to the former one by Deng [Mathematical Programming: Complexity and Application, Ph.D. di...
متن کاملUniform constant-depth threshold circuits for division and iterated multiplication
It has been known since the mid-1980's [15, 46, 47] that integer division can be performed by poly-time uniform constant-depth circuits of Majority gates; equivalently, the division problem lies in P-uniform TC 0. Recently this was improved to L-uniform TC 0 [19], but it remained unknown whether division can be performed by DLOGTIME-uniform TC 0 circuits. The DLOGTIME uniformity condition is re...
متن کامل